منابع مشابه
Towards a Typed Geometry of Interaction
notion of orthogonality (related to work of Hyland and Schalk.) We develop Girard’s original theory of types, data and algorithms in our setting, and show his execution formula to be an invariant of Cut Elimination (under some restrictions). We prove Soundness Theorems of the MGoI interpretation (for Multiplicative and Multiplicative Exponential Linear Logic) in partially traced ∗-categories wi...
متن کاملTowards a Typed Omega Algebra
We propose axioms for 1-free omega algebra, typed 1-free omega algebra and typed omega algebra. They are based on Kozen’s axioms for 1-free and typed Kleene algebra and Cohen’s axioms for the omega operation. In contrast to Kleene algebra, several laws of omega algebra turn into independent axioms in the typed or 1-free variants. We set up a matrix algebra over typed 1-free omega algebras by li...
متن کاملTowards Typed Prolog
Prolog is traditionally not statically typed. Since the benefits of static typing are huge, it was decided to grow a portable type system inside two widely used open source Prolog systems: SWI-Prolog and Yap. This requires close cooperation and agreement between the two systems. The type system is Hindley-Milner. The main characteristics of the introduction of types in SWI and Yap are that typi...
متن کاملTowards typed repositories of proofs
Motivations Practical efforts in the formalization of mathematical results have naturally led to the question of how to manage large repositories of proofs, i.e. what is the daily workflow of users of a proof assistant. How does one elaborate a formal proof? What kind of a posteriori modification is he prone to doing? What do these modifications imply on the validity of the whole edifice or, th...
متن کاملTowards a Strongly Typed Functional Operating System
In this paper, we present Famke. It is a library for Clean that enables the creation and management of independent distributed processes (written in Clean) on a network of computers. The main feature of Famke is that values of any type, i.e. data and code, can be communicated between independent processes in a type safe way. Famke uses Clean’s dynamic types and its dynamic linker to extend runn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2010
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s096012951000006x